Simultaneous allocation of buffer capacities and service times in unreliable production lines
نویسندگان
چکیده
Simultaneous allocation of service times and buffer capacities in manufacturing systems a random environment is NP-hard combinatorial optimisation problem. This paper presents sophisticated simulation-based approach for the design unreliable production lines to maximise rate. The proposed method allows global search using Genetic Algorithm (GA), which coupled with Finite Perturbation Analysis (FPA) as local technique. Traditional techniques based on perturbation analysis optimise decision variables same nature (e.g. time only, capacity only), whereas technique simultaneously provides an capacities. One main focuses this investigation persistence or absence rate patterns are among most essential insights that come from designing lines. results show superiority combined GA-FPA regarding GA FPA terms solution quality convergence behaviour. Moreover, considering instances ranging 3 100 machines, our numerical experiments line literature small (as similar identified work), but important differences highlighted medium/large instances.
منابع مشابه
Adaptive policy of buffer allocation and preventive maintenance actions in unreliable production lines
The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...
متن کاملComplexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines
Buffer capacity allocation problems for flow-line manufacturing systems with unreliable machines are studied. These problems arise in a wide range of manufacturing systems and concern determining buffer capacities with respect to a given optimality criterion which can depend on the average production rate of the line, buffer cost, inventory cost, etc. Here, this problem is proven to be NP-hard ...
متن کاملHBBA: hybrid algorithm for buffer allocation in tandem production lines
In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion dep...
متن کاملA New Algorithm for Buffer Allocation in Production Lines
In the paper a new efficient algorithm for the allocation of storage capacity in serial production lines is derived. The proposed method aims to find out the distribution of storage capacity between machines that minimizes the total buffer space assigned to the line satisfying a target production requirement. The algorithm relies on an iterative scheme that, starting from the minimal capacity r...
متن کاملOptimal Buffer Allocation in Production Lines Using an Automata Search
In this paper, we use a learning automata search technique (LAST), which is based on game theory, to solve the optimal buffer allocation problem in production lines. We have incorporated the search algorithm within a simulator in order to optimize the performance of a production line. We have conducted experiments with this algorithm on some problems for which optimal solutions are available in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2023
ISSN: ['1366-588X', '0020-7543']
DOI: https://doi.org/10.1080/00207543.2023.2168310